A commitment folk theorem
نویسندگان
چکیده
Real world players often increase their payo¤s by voluntarily committing to play a xed strategy, prior to the start of a strategic game. In fact, the players may further bene t from commitments that are conditional on the commitments of others. This paper proposes a model of conditional commitments that uni es earlier models while avoiding circularities that often arise in such models. A commitment folk theorem shows that the potential of voluntary conditional commitments is essentially unlimited. All feasible and individuallyrational payo¤s of a two-person strategic game can be attained at the equilibria of one (universal) commitment game that uses simple commitment devices. The commitments are voluntary in the sense that each player maintains the option of playing the game without commitment, as originally de ned.
منابع مشابه
On the Non-Existence of Reputation E®ects in Two-Person In ̄nitely-Repeated Games
Consider a two-person in ̄nitely-repeated game in which one player is either a normal \rational" type or a \commitment" type that automatically plays a ̄xed repeated-game strategy. When her true type is private information, a rational type may want to develop a reputation as a commitment type by mimicking the commitment type's actions. But, the uninformed player, anticipating the behavior of the...
متن کاملVoluntary Commitments Lead to Efficiency
Real world players often increase their payo¤s by voluntarily committing to play a xed strategy, prior to the start of a strategic game. In fact, the players may further bene t from commitments that are conditional on the commitments of others. This paper proposes a model of conditional commitments that uni es earlier models while avoiding circularities that often arise in such models. A commi...
متن کاملFolk theorem with communication
This paper proves a new folk theorem for repeated games with private monitoring and communication, extending the idea of delayed communication in Compte [6] to the case where private signals are correlated. The sufficient condition for the folk theorem is generically satisfied with more than two players, even when other well-known conditions are not. The folk theorem also applies to some two-pl...
متن کاملTwo Folk Manipulability Theorems in the General One-to-one Two-sided Matching Markets with Money
We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange, 1982, Leonard, 1983, Demange and Gale, 1985).
متن کاملAn Approximate Folk Theorem with Imperfect Private Information
We give a partial folk theorem for approximate equilibria of a class of discounted repeated games where each player receives a private signal of the play of his opponents . Our condition is that the game be "informationally connected," meaning that each player i has a deviation that can be statistically detected by player j regardless of the action of any third player k. Under the same conditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 69 شماره
صفحات -
تاریخ انتشار 2010